Network Randomization Protocol: A Proactive Pseudo-Random Generator
نویسندگان
چکیده
A major security threat to any security solutions based on a centralized server is the possibility of an adversary gaining access to and taking control of the server The adversary may then learn secrets cor rupt data or send erroneous messages In practice such an adversary may be more prevalent than one would like to admit It may be a malicious hacker a virus in an application program or an unscrupulous system administrator Proactive security is a novel approach to the server security problem It uses the distribution of data and control to multiple servers and periodic refreshes be tween servers By distributing data and control one or more servers may be compromised without com promising the system Periodic refreshes between servers allow a compromised server to recover af ter the attacker leaves thereby contributing to the system security A fraction in some cases all of the servers must be compromised simultaneously in order to compromise the system This paper describes the Network Randomization Protocol NRP a proactive protocol for gener ating cryptographically secure pseudo random num bers The protocol is designed for operation in the Internet and includes defenses against clogging at tacks Issues related to the design and implementa tion of the protocol are discussed As virtually no cryptographic task is possi ble without a source of randomness or pseudo randomness NRP is an important basic building block for many cryptographic functions Further more it serves to illustrate the main ideas and intu itions of proactive security
منابع مشابه
Improvement and Analysis of a Pseudo Random Bit Generator by Means of Cellular Automata
In this paper, we implement a revised pseudo random bit generator based on a rule-90 cellular automaton. For this purpose, we introduce a sequence matrix HN with the aim of calculating the pseudo random sequences of N bits employing the algorithm related to the automaton backward evolution. In addition, a multifractal structure of the matrix HN is revealed and quantified according to the multif...
متن کاملAn Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation
We present a pseudo-random bit generator expanding a uniformly random bitstring r of length k/2, where k is the security parameter, into a pseudo-random bit-string of length 2k − log(k) using one modular exponentiation. In contrast to all previous high expansion-rate pseudo-random bit generators, no hashing is necessary. The security of the generator is proved relative to Paillier’s composite d...
متن کاملThreshold and Proactive Pseudo-Random Permutations
We construct a reasonably efficient threshold and proactive pseudo-random permutation (PRP). Our protocol needs only O(1) communication rounds. It tolerates up to (n − 1)/2 of n dishonest servers in the semi-honest environment. Many protocols that use PRPs (e.g., a CBC block cipher mode) can now be translated into the distributed setting. Our main technique for constructing invertible threshold...
متن کاملTwo applications of pseudo-random graphs
We discuss two constructions based on pseudo-random graphs: a bitprobe scheme with one-sided error that provides a very compact encoding for small sets from a large universe, and an asymptotically optimal randomized communication protocol that synchronizes remote strings of bits with a small Hamming distance. We show that in both cases rather standard derandomization technique (e.g., Nisan’s ge...
متن کاملA Pseudo Random Number Generator Based on Chaotic Billiards
The systems of chaotic billiards revealed a well developed chaotic behavior. Despite its good characteristics, these systems have not yet been applied to the cryptography; among the reasons is the difficulty of expressing the equation of particle motion in an explicit form. In this work, we took advantage the properties offered by the random walks and unpredictability of two particles moving in...
متن کامل